An inequality for the binary skew-symmetric broadcast channel and its implications

We establish an information theoretic inequality concerning the binary skew-symmetric channel that was conjectured in [1]. This completes the proof that there is a gap between the inner bound[2] and the outer bound[3] for the 2receiver broadcast channel; and constitutes the first example of a provable gap between the bounds. The interesting aspect of the proof is the technique employed, and is partly motivated by the paper[4].